CPH: A Compact Representation for Hierarchical Meshes Generated by Primal Refinement
نویسندگان
چکیده
منابع مشابه
CPH: A Compact Representation for Hierarchical Meshes Generated by Primal Refinement
We present CPH (Compact Primal Hierarchy): a compact representation of the hierarchical connectivity of surface and volume manifold meshes generated through primal subdivision refinements. CPH is consistently defined in several dimensions and supports multiple kinds of tessellations and refinements, whether regular or adaptive. The basic idea is to store only the finest mesh, encoded in a class...
متن کاملSQuad: Compact Representation for Triangle Meshes
The SQuad data structure represents the connectivity of a triangle mesh by its “S table” of about 2 rpt (integer references per triangle). Yet it allows for a simple implementation of expected constant-time, random-access operators for traversing the mesh, including in-order traversal of the triangles incident upon a vertex. SQuad is more compact than the Corner Table (CT), which stores 6 rpt, ...
متن کاملA primal/dual representation for discrete Morse complexes on tetrahedral meshes
We consider the problem of computing discrete Morse and Morse-Smale complexes on an unstructured tetrahedral mesh discretizing the domain of a 3D scalar field. We use a duality argument to define the cells of the descending Morse complex in terms of the supplied (primal) tetrahedral mesh and those of the ascending complex in terms of its dual mesh. The Morse-Smale complex is then described comb...
متن کاملRefinement operators for triangle meshes
Refinement operators for triangular meshes as used in subdivision schemes or remeshing are discussed. A numbering scheme is presented, covering all refinement operators that (topologically) map vertices onto vertices. Using this characterization, some special properties of n-adic and √ 3-subdivision are easy to see.
متن کاملHierarchical Feature Extraction for Compact Representation and Classification of Datasets
Feature extraction methods do generally not account for hierarchical structure in the data. For example, PCA and ICA provide transformations that solely depend on global properties of the overall dataset. We here present a general approach for the extraction of feature hierarchies from datasets and their use for classification or clustering. A hierarchy of features extracted from a dataset ther...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2015
ISSN: 0167-7055
DOI: 10.1111/cgf.12667